package leetcode.lt100;

class Solution_63 {
	public static void main(String[] args) {
		int[][]obstacleGrid = new int[1][2];
		
		uniquePathsWithObstacles(obstacleGrid);
	}

	public static int uniquePathsWithObstacles(int[][] obstacleGrid) {
		if (obstacleGrid == null || obstacleGrid.length == 0 || obstacleGrid[0].length == 0) {
			return 0;
		}
		int m = obstacleGrid.length;
		int n = obstacleGrid[0].length;

		int[][] dp = new int[m][n];

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (obstacleGrid[i][j] == 1)
					continue;
				if (i == 0 && j == 0)
					dp[0][0] = 1;
				if (i > 0)
					dp[i][j] += dp[i - 1][j];
				if (j > 0)
					dp[i][j] += dp[i][j - 1];
			}
		}

		return dp[m - 1][n - 1];
	}
}